High-precision 3D position-finding system

ABSTRACT

A precise 3D position-finding system and method comprises at least the following elements: a set of beacons working on the basis of differential global positioning satellites (DGPS), the beacons being connected to one another and temporally synchronized, spread-spectrum radio means between the members of the network whose position is to be located and said beacons, and a computation station. The computation station is provided with a processor adapted to finding the position of one or more elements from a list of direct paths and/or multiple paths with the time and direction of arrival of each of the direct paths and/or multiple paths, and from the position of the beacons and in taking account of data that represents obstacles.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to a high-precision 3D positioning (or position-finding method) for finding the position of elements or individuals. The precision is, for example, of the order of one meter.

[0003] The individuals may be located in an open environment or in an urban environment. The system is called a 3D system because of its ability to single out an individual across several floors for example, thus introducing precision along the z-axis if we take a classic x, y, z system of coordinates.

[0004] It can be applied, for example, to locating the position of the members of an action team (of firefighters, doctors, special forces, maintenance teams in high-risk zones etc). It also relates to a wider public including, for example, medical personnel in hospitals, elderly persons in retirement homes, victims of avalanches etc.

[0005] 2. Description of the Prior Art

[0006] The currently used position-finding or positioning techniques draw extensively upon various techniques. Four of them are recalled here below.

[0007] 1. GPS (“Global Positioning System”) Type Satellite-Based Positioning Systems

[0008] In a GPS type satellite-based positioning system, the geographical position of a GPS receiver is determined by a triangulation of the pseudo-distances between the receiver and a cluster of satellites. This is possible only if the element or individual to be located is visible to the satellites. This is not the case in a certain number of situations (for example in the case of masking by forest cover, tunnels, operations in buildings, underground parking lots, etc.). Furthermore, the precision of a standard GPS, (processing of the frequency L1, code C/A) is in the range of 25 to 30 meters and therefore does not make for precision in the range of one meter. Furthermore, the precision of GPS systems assisted by pedometer or by an inertial guidance unit, for example, remains limited.

[0009] 2. Cell Radio Telephony Systems such as the GSM (“Global System for Mobile Communication”) Enabling Mobiles to Communicate by Radio with Other Mobiles or with the Public Switched Telephony Network, by Means of Stations Situated at the Center of each Cell of the Cell Network

[0010] In a GSM type communications system, the positions of the mobiles are located by a triangulation of the pseudo-distances measured between the mobile to be identified and the base stations. The initiative for measuring the pseudo-distances is taken either by the base stations neighboring the cell in which the mobile is moving or by the mobile. The precision of the position-finding obtained by this method is related to the density of the base stations: it is about 200 meters in urban areas and 400 meters in rural areas.

[0011] 3. Radiofreguency Transmission Systems Based on Radio Direction-Finding

[0012] In these systems, the positions of the mobiles are located:

[0013] Either by means of an autonomous search and position-finding device: in this case, the method makes use of a distance measurement by means of a transponder type principle (the search module sends out an interrogation signal to the element whose position is to be found or located, and this element instantaneously sends back the response signal) and a measurement of direction on this response signal. In this case, the method is generally of the “homing” type, i.e. the individual responsible for the search gradually approaches the mobile all long the period of movement. This is a highly uncertain technique because all that is needed is an obstacle to greatly weaken the signal and compromise the precision-finding process. Furthermore, the measurement of direction is often obtained by means of a directional antenna, because of the lack of precision and the space taken up by devices based on the differential measurement of phase between several antennas. This search by directional antenna also raises problems because it is imprecise with respect to the size of the antenna to be implemented.

[0014] Or by a triangulation of the pseudo-distances measured between the mobile to be identified and reference stations whose position is perfectly known. These stations are also perfectly synchronized, generally by cable, thus limiting the use to equipped zones only. Furthermore, the precision in these systems is always greatly affected, firstly by simultaneous transmissions (entailing collisions) from elements other than the one whose position is to be found or located and, secondly, by the many multiple paths encountered, especially in premises.

[0015] 4. Badge/Beacon Type Devices

[0016] In systems based on a beacon/badge type device, the zone is equipped with beacons (each beacon demarcating a portion of the zone in the same way as the base stations in the cell networks but with a range of some meters to some tens of meters) and the mobiles are fitted out with a transponder badge (which may be passive or active). The beacons are interconnected by a local area network and, when a mobile passes before one of them, a message is sent to the general monitoring center to update the position file. These systems are not compatible with outdoor use and require installation prior to any use in buildings. Furthermore, the precision of these devices is not greater than that of the range of each of these beacons, i.e. it is of the order of some tens of meters.

[0017] The object of the invention in particular is a 3D position-finding system with a precision of one meter for example, outdoors or indoors, at any floor whatsoever, without any interruption of operation.

[0018] The idea implemented in the method and in the system consists especially in using a mapping of the places associated with measurements of distance and angle, for example in order to reconstruct the direct paths and/or the multiple paths due to the different obstacles.

[0019] The beacons are designed to be easily installed, small-sized and low-cost devices, thus offering the possibility of being mounted on escort vehicles or moved according to the progress of positioning needs or the progress of the search or, again, recovered at the end of operation or, possibly, abandoned.

SUMMARY OF THE INVENTION

[0020] The invention uses especially a combination of beacons positioned and synchronized with precision, preferably by differential GPS, the beacons receiving the signals from the object or the person whose position is to be found or located. This person may be situated outdoors or indoors. The external beacons receive the signals from at least four satellites for example.

[0021] The invention relates to a precise 3D position-finding system comprising at least the following elements: a set of beacons working on the basis of differential global positioning satellites (DGPS), the beacons being connected to one another and time-synchronized or temporally synchronized, spread-spectrum radio means for connection between the members of the network whose position is to be located and said beacons, and a computation station. It is characterized in that the computation station is provided with a processor adapted to finding the position of one or more elements from a list of direct paths and/or multiple paths with the time and direction of arrival of each of the direct paths and/or multiple paths, and from the position of the beacons and in taking account of data that represents obstacles.

[0022] The number of beacons is equal, for example, to four. Three of these beacons are positioned in the same plane and the fourth has a given altitude relative to this plane.

[0023] The invention also pertains to a method for the 3D positioning of an element in a system comprising at least four beacons working on the basis of the differential global positioning system (DGPS), the beacons being temporally synchronized, wherein the system comprises at least the following steps:

[0024] the transmission, by a beacon, of its DGPS position and of a list of multiple paths with the time and direction of arrival of each of the direct paths and/or the multiple paths sent by the element whose position is to be located,

[0025] temporal or time readjustment, if necessary, in the event of a detected shift of one or more beacons,

[0026] the computation of the estimated positions of the element for the context of information received from each beacon,

[0027] a processing of the data using a mapping or a topology of the environment in which the element whose position is to be located is placed to reconstruct the different direct paths and/or multiple paths and to select the multiple paths to achieve a precise 3D determining of the element whose position is to be located.

[0028] The data-processing comprises a step to compare the retimed data and a step to eliminate information from the beacon or beacons that diverge excessively from the value indicated by the greatest number.

[0029] The invention has the following advantages in particular:

[0030] it offers:

[0031] a solution for locating the position of individuals in “difficult” environments, namely urban environments such as buildings, basements etc., i.e. places where the GPS signals normally do not penetrate,

[0032] an architecture that is simple and low-cost because it does not call for substantial deployment means. The beacons used are indeed small-sized and can therefore be moved, jettisoned, thrown out or easily positioned, and they are of moderate cost,

[0033] the method is compatible with all standardized waveforms, making it possible, for example, to use the waveform best suited to the application envisaged: for example a PN code modulated signal, UWB-type wide spread-spectrum technology etc.,

[0034] it provides the possibility of locating the position of a group of persons or objects, members of a same radio network,

[0035] it enables the locating of the position of the members of a same action team, but also facilitates the arrival of assistance or support at the precise places in which the persons in difficulty are placed or where there is an overload of persons.

BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Other characteristics and advantages of the object of the present invention shall appear more clearly from the following description given by way of an illustration that in no way restricts the scope of the invention, and from the appended figures of which:

[0037]FIG. 1 exemplifies an architecture of the device according to the invention,

[0038]FIG. 2 exemplifies a timing diagram of the signals exchanged between an element whose position is to be located and the different beacons,

[0039]FIG. 3 exemplifies the propagation of the different multiple paths,

[0040]FIGS. 4, 5 and 6 exemplify different signal-processing operations,

[0041]FIG. 7 shows a detail of the beacon according to the invention, and its links with the computation station and the reference station,

[0042]FIG. 1 shows a position-finding system according to the invention comprising at least four beacons B₁, B₂, B₃, B₄ (one of them is not shown for reasons of simplification), linked with a reference station B_(ref) having known coordinates. The four beacons work in differential GPS (or DGPS) mode with processing of the GPS carrier frequencies L₁ and L₂ (using the LRK algorithm for example). Three beacons are positioned in a same plane and the fourth beacon is placed outside this plane. For example, in FIG. 1, the beacon B₃ is positioned at a certain altitude h₃ defined relative to the reference plane determined by the other three beacons. An arrangement of this kind makes it possible to achieve position-finding precision of about one centimeter for each of the beacons, provided that the beacon is visible to at least four satellites.

[0043] In general, the first three beacons are, for example, deployed on the ground and the fourth is positioned above or beneath it. This fourth beacon is identified by a positive or negative difference in height h, determined from the plane defined by the other three beacons, (for example a difference in level of 5 meters), depending on whether the position-finding pertains to elements in buildings or in basements.

[0044] The number of beacons working in DGPS mode is at least equal to or greater than 4. The distance di between each of these beacons and the reference station B_(ref) may be, for example, several kilometers or even greater than 10 kilometers. The beacons are deployed either before an operation or else as and when required. They may be installed permanently. Choosing more than four beacons makes it possible especially to create redundancy and reject measurements from certain beacons deemed to be aberrations. Since each of the beacons can be recognized by its identification number and its position (each beacon is given an unambiguous identification number on four bytes for example, assigned in advance during manufacture and used also for its maintenance), the station in charge of the final computation can integrate all the information received. For example, as the firefighters or the police force move forward in an urban environment, the position-finding computation, depending on the place where the individual or the object to be located is situated, is done by certain of these beacons (the best-placed beacons) and then by others depending on the progress of the operations. The system also has a computation station B_(cal) that may be one of the beacons of the system. The station is provided with a processor adapted to executing the steps described in the method, receiving the numerous echoes coming from one or more elements whose position is to be located, processing the signals received and identifying the multiple paths (direct and/or indirect paths) to be used. The processor is adapted to interpreting and collating the different direct and/or multiple paths given by the different beacons, from the echoes received and also comprises a database grouping together information defining a topography or a mapping of the places, in order to determine the real position of the element whose position is to be located.

[0045] The beacons are, for example, linked together by radio means known to those skilled in the art or else by wire means. They are time-synchronized, for example, by means of a fine temporal readjustment algorithm applied prior to the computation or at the final stage of the computation.

[0046] The beacons are also linked with the elements of the individuals whose position is to be located, for example by means of spread-spectrum radio means.

[0047] Should the communication between the beacons be done by radio means, the means of communication between the beacons and the members of the network may be the same.

[0048] The means of communication between the beacons and the members of the network whose position is to be located may be the same as the standard means constituting the sound, video or fixed-image communications network between the objects and the persons. This has the advantage especially of achieving the position-finding with usual communications means.

[0049] According to another alternative embodiment, the spread-spectrum radio means between the members of the network whose position is to be located and the beacons are of different types. They include direct sequence waveforms (PN code), UWB, FHSS (Frequency Hopping Spread Spectrum), Chirp type frequency ramp, etc. The characteristic common to all the beacons is that they are spread-spectrum beacons with a minimum spread, equal to 10 MHz for example.

[0050] The characteristics of the beacons especially are that they are small-sized, easily positioned and can be made at low-cost. Thus, they can be dropped by parachute, launched by a device, hoisted or, again, positioned by any appropriate means on the roof of the building or again at a height. The beacons remain always accessible to the satellite. They can be easily launched or placed on buildings and abandoned at the end of the operation or mission. An exemplary detail of a beacon is given in FIG. 3. This beacon is linked with the reference station and the computation station.

[0051] According to one alternative embodiment, in indoor type deployment, certain elements or members of the group, possibly better placed with respect to the outdoor beacons, are capable of relaying the transmission of the signal sent by the element whose position is to be located or which has to make its position located while, at the same time, indicating the relative positioning of the element whose position is to be located.

[0052] The following is a simple procedure to be used: the central computation system, which receives all the information contexts and carries out the consistency processing as well as the computation of the position, realizes that the positioning of the user is impossible or an aberration. It then sends an interrogation to the group (the elements of the network) to find out which is closest to the user concerned. Indeed, each member of the group knows the proximity of the others, either by the power of the signal received or by a relative positioning in distance. Each member of the group close to the user to be positioned therefore sends the proximity information pertaining to this user, namely the relative distance, signal power, transmission quality, etc., and the position of the “closest” user is located to gain a piece of rough information on the “masked” user. In many cases, the invention is used to locate the position of a group of persons or objects that are members of one and the same radio network. This same network communicates with the beacons and is therefore used for both position-finding and communications in sound or data mode.

[0053] One or more beacons are, for example, positioned at places, such as windows, that are more favorable to the reception of signals from the members of the network whose position is to be located.

[0054] All the external beacons are, for example, placed on vehicles that move according to requirements, the synchronization time (the initial time from the activation) being extremely small, of the order of one minute.

[0055]FIG. 2 is an exemplary timing diagram of the signals exchanged according to the steps of the method.

[0056] It is known that finding the position of elements in a closed or indoor environment (namely in buildings, etc.) is affected by problems of propagation such as absorption as well as the existence of multiple paths by reflection. To cope with these phenomena, two complementary mechanisms may be implemented.

[0057] In the first mechanism, a technique for the processing of direct and reflected echoes is set up. This technique relies on the capacity of certain spread-spectrum waveforms to facilitate the determining of the direction of arrival of the different paths. The beacon, which receives the different paths, then sends the list and direction of these multiple paths (direct paths and reflected paths) to the station in charge of the position-finding computation. This station can interpret and collate these different multiple paths given by the different beacons by means of a mapping of the places.

[0058] The second mechanism relies on the capacity of certain elements or members of the group, possibly better placed relative to the outdoor beacons, to relay the transmission of the signal sent by the element whose position is to be located or which has to make its position located, while indicating the relative positioning of the element whose position has to be located.

[0059] The following example given by way of an illustration relates to the case of a request mode of position-finding.

[0060] Step 1

[0061] The initialization of the DGPS beacons (visible to the satellites) and the obtaining of precision to within the centimeter, for example for each of the beacons used. Each beacon Bi gets initialized independently of the others and needs only the reference station to be able to carry out its temporal readjustment in DGPS mode.

[0062] Step 2

[0063] The readjustment of the absolute clock of each DGPS beacon (preliminary temporal readjustment) in taking account of the difference in distance from each beacon to the satellites and using a “clock readjustment algorithm” type of readjustment algorithm known to those skilled in the art. This readjustment algorithm makes it possible especially to take account of the effects of the difference in the progress of the signals between a satellite and the beacons on the ground. Each beacon, using the information given by the reference station, performs this readjustment operation.

[0064] If the readjustment is not done at this stage, the steps described here below will remain applicable and the station responsible for the position-finding computation will then have to make the correction in the position-finding computation (final readjustment).

[0065] Step 3

[0066] As soon as there is a minimum number of synchronized beacons, for example four beacons (three beacons in a same plane and a fourth beacon outside this plane), one of the beacons is authorized to send a transmission request to the element whose position is to be located. For example, the central system itself sends the request or else it asks one of the beacons to do so if it is not within radio range of the elements whose position is to be located. Each beacon, as soon as it is operation, starts making its measurements:

[0067] either in no-request mode, by detecting the signals sent out by the different members of the group, identifying the identification number of each received signal, sending the context of detected information namely the beacon number, the identification number of the member detected, the list of the pieces of information measured on the different multiple paths of the received signal. This is repeated for each new signal sent out by any one member of the group,

[0068] or in request mode, in informing the computation station or any authority that it is operational. This authority than makes the request for transmission by turns, according to the needs of the members of the network. This authority is generally the same as the central computation system because the latter has information on the position of the elements and is therefore able to deduce those elements whose position needs to be located. Without departing from the framework the invention, it is possible to use another “authority” independent of the central computation system.

[0069] Step 4

[0070] The element whose position is to be located receives the position-finding request and then sends a frequency-spread signal S_(e). Should there be a second element, defined for example as being the best placed member that is interrogated instead of the member masked according to the procedure described here above, then it is this second element that sends the frequency-spread signal S_(e).

[0071] Step 5

[0072] The signal S_(e) is received by the different beacons, with a delay time τ_(i) for each of the beacons B₁, B₂, B₃ and B₄. This delay time is proportional to the distance di between the element whose position is to be located and the beacons. This sent signal comprises for example a reference sequence.

[0073] Step 6

[0074] At each of the beacons within range of the element whose position is to be located, the arrival time of the signal is then estimated, for example by the instant of maximum correlation of the received signal with the expected reference sequence. All the beacons wait for this signature and note the precise instant of arrival of this signature. This instant is associated with an identification number of the member sending the signal. In fact, since there are multiple paths, this signature or reference signal will return several times in a very short time, according to the different reflections undergone by the signal sent by the member of the group.

[0075] Step 7

[0076] The different pieces of information on arrival time ti are then transmitted to the computation station. The arrival times are used basically to define a pseudo-distance dp between the elements whose position is to be located and the different beacons. The triangulation algorithm used is, for example, based on the intersection of the spheres having a radius equal to the pseudo-distance dp estimated for each of the beacons. Furthermore, the directions of arrival of the multiple paths associated with the pseudo-distances of these multiple paths will be used to supplement the approach based solely on the pseudo-distances of the main path.

[0077] The processor comprises, for example, the following in memory: a database representing the topology of the places, especially of the different existing obstacles. It is capable of combining these different topological data and the measurements of angle, distance and amplitude to reconstruct the multiple paths and also select the multiple paths that it will use.

[0078] An exemplary implementation of a processing operation is given with reference to FIGS. 3, 4 and 5 described in detail further below.

[0079] Different alternative embodiments may be implemented for the step 3.

[0080] According to one embodiment, several elements whose position is to be located are assigned to making a response. In this case, a procedure of random waiting at transmission then makes it possible, at reception, to separate the signals sent out by the different elements whose position is to be located.

[0081] According to another alternative embodiments, the position-finding is done without sending out any position-finding request. This is possible, for example, for a system in which a same radio is used for the information exchanges (communications function) and for the position-finding. Thus, when an element sends out a signal to communicate, the beacons makes use of the following transmissions sent out by the same element. Indeed, the signal-to-noise ratio required to obtain a precision of about one meter is great. It is in the range of 27 dB and it may be useful, in order to obtain it, to integrate the signal over a certain duration. Thus, in this mode, it is only when an element is too late in sending a signal that it becomes necessary to make the request to force it to send the signal. This complementary mode is particularly useful to prevent the saturation of the communications network and remain silent to the maximum. In this (no-request) mode, it is the communications signals that are directly used in the steps described here above.

[0082] The precision of the system is improved, for example, by the knowledge of certain persons of the network indicating a proximity. The precision may also be reinforced by the use of a radio or several radios of the network placed in a perfectly known location.

[0083] When the synchronization between the beacons is no longer available, the transponder mode can be used on the members of the network whose position is to be located.

[0084] Following the reception of position-finding information, each member of the network may confirm that it is present or not present at its position and consequently augment the precision of the system.

[0085] An exemplary processing for the discrimination of the multiple paths is given here below with reference to FIGS. 3, 4, 5 and 6. In FIG. 3 for example, the different propagation paths T_(m,n) are referenced as follows:

[0086] m designates the beacon receiving the signals,

[0087] n designates the number of the direct or multiple path (0: direct path, 1: first multiple path, etc.).

[0088] The discrimination of the multiple paths is done, for example, by means of a spread-spectrum waveform (characteristic of the signal sent by the elements whose position is to be located). The different spread-spectrum methods that can be cited include frequency hopping, pseudo-random codes of the PN or other types, UWB, LWMA (Linear Wideband Multiple Access) type frequency ramp methods etc.

[0089] The spread-spectrum parameters and the minimum signal-to-noise ratio are chosen especially as a function of the precision, the maximum distance and the environment. For example, a minimum spread of 5 to 10 MHz gives, for example, precision of 1 m. Furthermore, the frequency hopping type or PN code type spread-spectrum methods enable the discrimination of the echoes in distance. The UWB method, owing to its spread in the absence of carriers, is capable of distinguishing the echoes in distance with a high precision of about one centimeter or about ten centimeters.

[0090] The LWMA method is capable of achieving a twofold discrimination of the echoes in distance and in direction. This method is described in detail here below by way of an exemplary illustration that in no way restricts the scope of the invention.

[0091] In the case of a frequency ramp, the following is the signal S_(e), sent out by an element whose position is to be located, and received by an antenna (A₁ FIG. 4): $\begin{matrix} {{S_{1}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\}}}} & (1) \end{matrix}$

[0092] This signal is formed by a direct signal and by (N−1) multiple paths, with:

[0093] a₀: the amplitude of the direct path

[0094] a_(i)(i≠0) : the amplitudes of the multiple paths

[0095] f₀: beat frequency due to the direct path

[0096] f_(i)(i≠0) : beat frequencies due to the multiple paths

[0097] τ₀: transmission delay of the direct paths

[0098] τ_(i)(i≠0): transmission delay of the multiple paths

[0099] φ₀: phase of the signal of the direct path

[0100] i(i≠0) : phases of the signals of the multiple paths

[0101] The beat frequency is related to the transmission delay by the relationship (2): f_(i)=s τ_(i) in which s is the slope of the ramp.

[0102] The phase of the signal is related to the transmission delay by the relationship (3): (φ_(i)=2πf_(c)τ_(i) where f_(c) represents the carrier at the start of the ramp.

[0103] The transmission delay is related to the distance by the relationship (4): τ_(i)=d_(i)/c in which c represents the speed of propagation of the electromagnetic waves.

[0104] If we consider another omnidirectional antenna in reception (indexed 2), the received signal is then: $\begin{matrix} {{S_{2}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad \left( {f_{i} + {\Delta \quad f_{i}}} \right)\left( {t - {\frac{1}{2}\left( {\tau_{i} + {\Delta \quad \tau_{i}}} \right)}} \right)} + {\phi_{i}\Delta \quad \phi_{i}}} \right\}}}} & (5) \end{matrix}$

[0105] The differences Δf_(i), Δφ_(i), Δτ_(i) are prompted by the stretching or reduction of the path Δd_(i) to reach the second antenna (A₂ FIG. 4), according to the orientation of the waves relative to the axis of two antennas as shown diagrammatically in FIG. 4.

Δf_(i)=s Δτ_(i)

Δφ_(i)=2πf_(c)Δτ_(i)

Δτ_(i) =d _(i) /c

[0106] Thus, by using a set of antennas, it is possible to distinguish the signals of the multiple paths and indicate the corresponding direction of arrival for each of them.

[0107] For example, when the multiple paths are distinguished by means of the LWMA technique, they are characterized by the following variables:

f_(i)=s τ_(i)

φ_(i)=2πf_(c)τ_(i)

τ_(i) =d _(i) /c

[0108] and by the three additional variables mentioned here above Δf_(i), Δφ_(i), Δτ_(i) depending on the differences in propagation time between the first and second antennas. All the quantities Δf_(i), Δφ_(i), Δτ_(i) of the i^(st) multiple path depend on Δdi, which is the difference in distance for this multiple path between the first and the second antenna.

[0109] This means that a signal coming from a given direction has frequency shifts in addition to the phase differences obtained on the fixed-frequency devices. This additional parameter may be advantageously used to discriminate between the different multiple paths.

[0110] The processing method can also be extended to a system comprising four antennas A₁, A₂, A₃, A₄ (FIG. 4). The signals are then the following (6): ${S_{1}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\}}}$ ${S_{2}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad \left( {f_{i} + {\Delta \quad f_{i}^{21}}} \right)\left( {t - \frac{\left( {\tau_{i} + {\Delta \quad \tau_{i}^{21}}} \right)}{2}} \right)} + \phi_{i} + {\Delta \quad \phi_{i}^{21}}} \right\}}}$ ${S_{3}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad \left( {f_{i} + {\Delta \quad f_{i}^{31}}} \right)\left( {t - \frac{\left( {\tau_{i} + {\Delta \quad \tau_{i}^{31}}} \right)}{2}} \right)} + \phi_{i} + {\Delta \quad \phi_{i}^{31}}} \right\}}}$ ${S_{4}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad \left( {f_{i} + {\Delta \quad f_{i}^{41}}} \right)\left( {t - \frac{\left( {\tau_{i} + {\Delta \quad \tau_{i}^{41}}} \right)}{2}} \right)} + \phi_{i} + {\Delta \quad \phi_{i}^{41}}} \right\}}}$

[0111] The exponent mn signifies: signal on the m^(th) antenna in taking account of the path to be traveled relative to the n^(th) antenna

[0112] Example: Δf_(i) ³¹ represents the difference in frequency due to the i^(th) multiple path arriving at the 3^(rd) antenna in taking account of the path to be traveled relative to the 1^(st) antenna (path difference for this multiple path between the 3^(rd) antenna and the 1^(st) antenna).

[0113] The signals have the following general form (7): ${S_{k}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad \left( {f_{i} + {\Delta \quad f_{i}}} \right)\left( {t - \frac{\left( {\tau_{i} + {\Delta \quad \tau_{i}}} \right)}{2}} \right)} + \phi_{i} + {\Delta \quad \phi_{i}}} \right\}}}$

[0114] The following are the different terms: $\begin{matrix} {T_{1} = \left. \left\{ {{2\pi \quad {f_{i}\left( {t - {\tau_{i}/2}} \right)}} + \phi_{i}} \right\}\Rightarrow{{basic}\quad {terms}} \right.} & (8) \\ {T_{2} = \left. \left\{ {2\pi \quad f_{i}\Delta \quad {\tau_{i}/2}} \right\}\Rightarrow{{additional}\quad {term}} \right.} & (9) \\ {T_{3} = \left. \left\{ {{2\pi \quad \Delta \quad f_{i}\quad \left( {t - {\tau_{i}/2} - {\Delta \quad {\tau_{i}/2}}} \right)} + {\Delta \quad \phi_{i}}} \right\}\Rightarrow{{other}\quad {additive}\quad {term}} \right.} & (10) \end{matrix}$

NUMERICAL EXAMPLE

[0115] a=30 cm whence Δτ_(i max)=1 ns where a is the distance between the antennas. Should there be four antennas, a corresponds to the side of the square plotted by the four antennas.

[0116] f_(i max)=66 kHz for d=1000 m and a slope of (20 MHz, 1 ms)=20 10⁹ Hz/s, where d is the distance between the element whose position is to be located and the beacon.

[0117] f_(i max)Δτ_(i max)˜10⁻⁴ hence the term T₂ is negligible.

[0118] Δf_(i max)=1 ns*20 10⁹=20 Hz

[0119] Δτ_(i max)Δf_(i max)=negligible

[0120] Δφ_(i max)=2πf_(c)Δτ_(i max): non-negligible due to the carrier frequency.

[0121] Finally, the expression of the signal may be simplified and reduced to the following form: $\begin{matrix} {{{S_{k}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\} ^{- j}\left\{ {{2\pi \quad \Delta \quad f_{i}t} + {\Delta \quad \phi_{i}}} \right\}}}}{{Whence}\text{:}}{{S_{1}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\}}}}{{S_{2}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\} ^{- j}\left\{ {{2\pi \quad f_{i}^{21}t} + {\Delta \quad \phi_{i}^{21}}} \right\}}}}{{S_{3}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\} ^{- j}\left\{ {{2\pi \quad f_{i}^{31}t} + {\Delta \quad \phi_{i}^{31}}} \right\}}}}{{S_{4}(t)} = {\sum\limits_{i = 0}^{N - 1}\quad {a_{i}^{- j}\left\{ {{2\pi \quad {f_{i}\left( \frac{t - \tau_{i}}{2} \right)}} + \phi_{i}} \right\} ^{- j}\left\{ {{2\pi \quad f_{i}^{41}t} + {\Delta \quad \phi_{i}^{41}}} \right\}}}}} & (11) \end{matrix}$

[0122] Different algorithms for the processing of these signals may be used to reveal the different quantities of the multiple paths.

[0123] In one of the simplest algorithms, a spectral analysis is performed on each of the signals of the different antennas. Thus, for each antenna and for each member of the network that makes transmission, Prony's method is used to determine the frequencies, the amplitudes, the initial phases as well as the damping coefficients. The frequencies and the phases for the different antennas may be directly compared with one another to give the direction of each multiple paths (including the direct path).

[0124] Other methods, more optimized and better adapted to the particular context of the signals and known to those skilled in the art, may also be used without departing from the framework of the invention.

[0125] When the multiple paths have been identified, the method is carried out, for example, as follows.

[0126] In addition to its precise GPS position and for the signal sent by a member to be positioned, each beacon then transmits a list of multiple paths with the time and the direction of arrival of each of the multiple paths. Thus there is a set of data expressed as follows:

[0127] Beacon No. 1

[0128] GPS position of beacon 1

[0129] N° xyz of the member

a_(1,0); t_(1,0), θ_(1,0)

a_(1,1); t_(1,1); θ_(1,1)

a_(1,j); t_(1,j); θ_(1,j)

[0130] where {0,1, . . . i} correspond to the indices of the different multiple paths.

[0131] Beacon No. 2

[0132] GPS position of beacon 2

[0133] No. xyz of the member

a_(2,0); t_(2,0); θ_(2,0)

a_(2,1); t_(2,1); θ_(2,1)

a_(2,j); t_(2,j); θ_(2,j)

[0134] Beacon n° N

[0135] GPS position of beacon i

[0136] No. xyz of the member

a_(N,0); t_(N,0); θ_(N,0)

a_(N,1); t_(N,1); θ_(N,1)

a_(N,j); t_(N,j); θ_(N,j)

[0137] The computation station:

[0138] receives all this information (GPS position, beacon 1; echo 1: amplitude, arrival time, angle of arrival, echo 2, etc.)

[0139] readjusts the time-related information in the case of a detected shift of one or more beacons,

[0140] computes the estimated positions of the mobile or of the element whose position is to be located for the information context received from each beacon, and

[0141] then processes the data in three possible modes

[0142] First Mode Illustrated in FIG. 5:

[0143] The first mode consists in comparing the readjusted data and eliminating the information from the beacon or beacons that diverges excessively from the indicated value, for example information that diverges by the greatest number. This is possible especially if the number of beacons is greater than the minimum number 4 to make the measurement. D_(k,i) θ_(k,i) a_(k,i) corresponds to the path No. i received by the beacon k.

[0144] For the beacon 1: D_(1,0)θ_(1,0)a_(1,0) . . . , D_(1,1)θ_(1,1)a_(1,1) . . . , D_(1,2)θ_(1,2)a_(1,2) . . . ,

[0145] For the beacon 2: D_(2,0)θ_(2,0)a_(2,0) . . . , D_(2,1)θ_(2,1)a_(2,1) . . . , D_(2,2)θ_(2,2)a_(2,2) . . . ,

[0146] For the beacon N: D_(N,0)θ_(N,0)a_(N,0) . . . , D_(N,1)θ_(N,1)a_(N,1) . . . , D_(N,2)θ_(N,2)a_(N,2)

[0147] In this example, the signals of the beacon No. 5 are withdrawn because they are excessively error-ridden. The definitive position of the element whose position is to be located is computed in taking account of the direct paths coming from the other four beacons. The paths, other than the direct ones, are not exploited in this mode.

[0148] Second Mode Illustrated in FIG. 6

[0149] The second mode consists, for example, in taking account of the information on the multiple paths by comparing the readjusted data with a mapping database. The multiple paths are then interpreted in addition to the direct paths. Furthermore, in certain situations of propagation, the direct paths are not received and the first echo is wrongly classified as a direct path. This method is used to test the possibility that an echo, taken as being direct, may actually be a multiple path.

[0150] Thus FIG. 6 gives a schematic view of the reconstruction of the multiple paths in taking account of the data transmitted to the computation station as well as a database (or mapping) representing the different existing obstacles.

[0151] Third Mode

[0152] In the third mode, a very precise piece of positional information is received by radio (for example the message may state: “mobile X exactly at the fountain”) and the system is calibrated according to the information received.

[0153]FIG. 7 gives a schematic view of a possible detail of the beacon and its links with a computation station and the reference station.

[0154] A beacon comprises, for example, a part I designed especially to receive the spread-spectrum signal sent by the element whose position is to be located; this is done by means of an antenna system 20 comprising a set of four antennas, for example adapted to the reception of spread-spectrum waveforms. This part comprises a processor 21 capable of identifying the mobile element to be identified, for example by means of the message included in the header. Once the mobile is identified, the processor carries out different processing operations, such as discriminating the multiple paths in distance and in direction of arrival, and it also determines the amplitude of the signal. At the end of this processing operation, the beacon possesses a context of information for the mobile concerned. This information is expressed for example in the form of a set ai,j; ti,j; θi,j with i being the index of the beacon concerned and j being the index of a multiple path.

[0155] The beacon also has a part II comprising for example an antenna 22 chosen to receive the GPS signals.

[0156] It also has another transmitter-receiver antenna 23 which communicates with the computation station and also the reference station B_(ref) to receive DGPS correction data.

[0157] The context of information for the element whose position is to be located as well as the DGPS data (precise position of the beacon) is transmitted in the form of a message to the computation station by means of the antenna 23. This antenna 23 receives the DGPS correction data which it sends to the GPS positioning part.

[0158] If necessary, this arrangement is given an additional stage of radio transmission to the mobile, if the distance measurement is done not only by passive listening and not only through a request from the computation station but also by any beacon (preferably the best-placed beacon) upon a preliminary command from the computation station for example.

[0159] In certain cases, the control station may also control the motions of the different beacons. This alternative embodiment especially enables dynamic 3D position-finding.

[0160] The system can also work in a simplified mode in which the mapping is no longer used and in which the multiple paths are no longer taken into consideration. 

What is claimed is:
 1. A precise 3D position-finding system comprising at least the following elements: a set of beacons working on the basis of differential global positioning satellites (DGPS), the beacons being connected to one another and temporally synchronized, spread-spectrum radio means between the members of the network whose position is to be located and said beacons, and a computation station, wherein the computation station is provided with a processor adapted to finding the position of one or more elements from a list of direct paths and/or multiple paths with the time and direction of arrival of each of the direct paths and/or multiple paths, and from the position of the beacons and in taking account of data that represents obstacles.
 2. A system according to claim 1, wherein the number of beacons is at least equal to four, three of them being positioned in the same plane and the fourth having a given altitude relative to this plane.
 3. A system according to one of the claims 1 and 2, wherein the means of communication between the beacons and the members of the network whose position is to be located are identical or appreciably identical to the standard means that constitute the communications network and accept sound, video and fixed images.
 4. A system according to claim 1, wherein the spread-spectrum radio means, between the members of the network whose position is to be located and the beacons, are of different natures, such as direct sequence waveforms (PN code), UWB, FHSS (Frequency Hopping Spread Spectrum), chirp type frequency ramp, etc.
 5. A method for the 3D positioning of an element in a system comprising at least four beacons working on the basis of the differential global positioning system (DGPS), the beacons being temporally synchronized, wherein the system comprises at least the following steps: the transmission, by a beacon, of its DGPS position and of a list of multiple paths with the time and direction of arrival of each of the direct paths and/or the multiple paths sent by the element whose position is to be located, temporal readjustment, if necessary in the event of a detected shift, of one or more beacons, the computation of the estimated positions of the element for the context of information received from each beacon, a processing of the data using a mapping or a topology of the environment in which the element whose position is to be located is placed to reconstruct the different direct paths and/or multiple paths and select the multiple paths to achieve a precise 3D determining of the element whose position is to be located.
 6. A method according to claim 5, wherein the data-processing comprises a step to compare the readjusted data and a step to eliminate information from the beacon or beacons that diverge excessively from the value indicated by the greatest number of beacons.
 7. A method according to claim 5, wherein the processing of the data comprises the taking into account of information on the multiple paths by comparing the readjusted data with a mapping database.
 8. A method according to claim 5, wherein one of the beacons sends a request in order to locate the position of the element.
 9. A method according to claim 5, wherein the position-finding is done by examining the communications signals sent in the course of time by the element or elements to whose position is to be located.
 10. A method according to one of the claims 5 to 9 wherein the signals exchanged between the beacons and the members of the network whose position is to be located are identical or appreciably identical to the standard means that constitute the communications network and accept sound, video and fixed images.
 11. A method according to one of the claims 5 to 9, using spread-spectrum radio means, between the members of the network whose position is to be located and the beacons, that are of different natures, such as direct sequence waveforms (PN code), UWB, FHSS (Frequency Hopping Spread Spectrum), chirp type frequency ramp, etc. 